Venn Symmetry and Prime Numbers: A Seductive Proof Revisited
نویسندگان
چکیده
An n-Venn diagram is a Venn diagram on n sets, which is defined to be a collection of n simple closed curves (Jordan curves) C1, C2, ..., Cn in the plane such that any two intersect in finitely many points and each of the 2n sets of the form Ë Cie is nonempty and connected, where ei is one of "interior" or "exterior". Thus the Venn regions are all bounded except for the region exterior to all curves; the finite intersection property means that each bounded region is the interior of a Jordan curve. See [6] for much more information on Venn diagrams. An n-Venn diagram is symmetric if each curve Ci is riHC1L, where r is a rotation of order n about some center (we use O for the fixed point of rotation r).
منابع مشابه
Venn Diagrams and Symmetric Chain Decompositions in the Boolean Lattice Preliminary Draft
In this paper we show that symmetric Venn diagrams for n sets exist for every prime n, settling an open question. Until this time, n = 11 was the largest prime for which the existence of such diagrams had been proven. We show that the problem can be reduced to finding a symmetric chain decomposition, satisfying a certain cover property, in a subposet of the Boolean lattice Bn, and prove that su...
متن کاملVenn Diagrams and Symmetric Chain Decompositions in the Boolean Lattice
We show that symmetric Venn diagrams for n sets exist for every prime n, settling an open question. Until this time, n = 11 was the largest prime for which the existence of such diagrams had been proven, a result of Peter Hamburger. We show that the problem can be reduced to finding a symmetric chain decomposition, satisfying a certain cover property, in a subposet of the Boolean lattice Bn, an...
متن کاملNew Roses: Simple Symmetric Venn Diagrams with 11 and 13 Curves
A symmetric n-Venn diagram is one that is invariant under n-fold rotation, up to a relabeling of curves. A simple n-Venn diagram is an n-Venn diagram in which at most two curves intersect at any point. In this paper, we introduce a new property of Venn diagrams called crosscut symmetry, which is related to dihedral symmetry. Utilizing a computer search restricted to diagrams with crosscut symme...
متن کاملDoodles and doilies, non-simple symmetric Venn diagram
In this paper we create and implement a method to construct a non-simple, symmetric 11-Venn diagram. By doing this we answer a question of Gr unbaum. Daniel Kleitman's mathematics seems to be remote from this area, but in fact, his results inspired this solution, which holds promise of settling the general case for all prime numbers, and the promise to nd simple doilies with 11 and more curves...
متن کاملA New Rose : The First Simple Symmetric 11-Venn Diagram
A symmetric Venn diagram is one that is invariant under rotation, up to a relabeling of curves. A simple Venn diagram is one in which at most two curves intersect at any point. In this paper we introduce a new property of Venn diagrams called crosscut symmetry, which is related to dihedral symmetry. Utilizing a computer search restricted to crosscut symmetry we found many simple symmetric Venn ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- The American Mathematical Monthly
دوره 115 شماره
صفحات -
تاریخ انتشار 2008